Exploiting Sparsity in Complex Polynomial Optimization
نویسندگان
چکیده
In this paper, we study the sparsity-adapted complex moment-Hermitian sum of squares (moment-HSOS) hierarchy for polynomial optimization problems, where sparsity includes correlative and term sparsity. We compare strengths moment-HSOS with real moment-SOS on either randomly generated problems or AC optimal power flow problem. The results numerical experiments show that provides a trade-off between computational cost quality obtained bounds large-scale problems.
منابع مشابه
Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems
We present a survey on the sparse SDP relaxation proposed as a sparse variant of Lasserre’s SDP relaxation of polynomial optimization problems. We discuss the primal and dual approaches to derive the sparse SDP and SOS relaxations, and their relationship. In particular, exploiting structured sparsity in the both approaches is described in view of the quality and the size of the SDP relaxations....
متن کاملConvergent SDP-Relaxations for Polynomial Optimization with Sparsity
We consider a polynomial programming problem P on a compact semi-algebraic set K ⊂ Rn, described by m polynomial inequalities gj(X) ≥ 0, and with criterion f ∈ R[X]. We propose a hierarchy of semidefinite relaxations in the spirit those of Waki et al. [9]. In particular, the SDP-relaxation of order r has the following two features: (a) The number of variables is O(κ2r) where κ = max[κ1, κ2] wit...
متن کاملExploiting sparsity in adaptive filters
This paper studies a class of algorithms called Natural Gradient (NG) algorithms, and their approximations, known as ANG algorithms. The LMS algorithm is derived within the NG framework, and a family of LMS variants that exploit sparsity is derived. Mean squared error (MSE) analysis of the family of ANG algorithms is provided, and it is shown that if the system is sparse, then the new algorithm...
متن کاملExploiting Sparsity in Polyhedral Analysis
The intrinsic cost of polyhedra has lead to research on more tractable sub-classes of linear inequalities. Rather than committing to the precision of such a sub-class, this paper presents a projection algorithm that works directly on any sparse system of inequalities and which sacrifices precision only when necessary. The algorithm is based on a novel combination of the Fourier-Motzkin algorith...
متن کاملExploiting Symmetries in SDP-Relaxations for Polynomial Optimization
In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semidefinite programming relaxations. Our special focus is on constrained problems especially when the symmetric group is acting on the variables. In particular, we investigate the concept of block decomposition within the framework of constrained polynomial optimizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2021
ISSN: ['0022-3239', '1573-2878']
DOI: https://doi.org/10.1007/s10957-021-01975-z